General Improvements of Heuristic Algorithms for Low Complexity DOA Estimation
نویسندگان
چکیده
منابع مشابه
Low-complexity estimation of 2D DOA for coherently distributed sources
We consider the estimation of two-dimensional (azimuth and elevation) direction-of-arrival (DOA) using a pair of uniform circular arrays under a coherently distributed source model. Since the coherently distributed source is characterized by four parameters, the nominal azimuth DOA, angular extension of the azimuth DOA, nominal elevation DOA, and angular extension of the elevation DOA, the comp...
متن کاملA Low-Complexity ESPRIT-Based DOA Estimation Method for Co-Prime Linear Arrays
The problem of direction-of-arrival (DOA) estimation is investigated for co-prime array, where the co-prime array consists of two uniform sparse linear subarrays with extended inter-element spacing. For each sparse subarray, true DOAs are mapped into several equivalent angles impinging on the traditional uniform linear array with half-wavelength spacing. Then, by applying the estimation of sign...
متن کاملLow-Complexity and High-Resolution DOA Estimation for Hybrid Analog and Digital Massive MIMO Receive Array
A large-scale fully-digital receive antenna array can provide very high-resolution direction of arrival (DOA) estimation, but resulting in a significantly high RF-chain circuit cost. Thus, a hybrid analog and digital (HAD) structure is preferred. Two phase alignment (PA) methods, HAD PA (HADPA) and hybrid digital and analog PA (HDAPA), are proposed to estimate DOA based on the parametric method...
متن کاملLow-complexity DOA estimation from short data snapshots for ULA systems using the annihilating filter technique
This paper addresses the problem of DOA estimation using uniform linear array (ULA) antenna configurations. We propose a new low-cost method of multiple DOA estimation from very short data snapshots. The new estimator is based on the annihilating filter (AF) technique. It is non-data-aided (NDA) and does not impinge therefore on the whole throughput of the system. The noise components are assum...
متن کاملComplexity Analysis of Heuristic CSP Search Algorithms
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗(dn), where n and d are the number of variables and the maximal domain size of the underlying CSP, respectively. In this paper we show that a combination of heuristic methods of constraint solving can reduce the time complexity. In particular, we prove that the FC-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Antennas and Propagation
سال: 2019
ISSN: 1687-5869,1687-5877
DOI: 10.1155/2019/3858794